Addresses concrete, in-scope editorial items from #419.

Changes

• Rename "Jump Chain Algorithm" → "Move algorithm" — the algorithm (draw a location, accept if happy, otherwise retry) isn't a Markov jump chain; the old title was misleading.
• Wrap the main-loop pseudocode in a prf:algorithm admonition — was code-block:: none, inconsistent with the earlier algorithm block.
• Remove print('Entering loop ', count) from run_simulation — produced noisy Entering loop 1, Entering loop 2, … output during simulation.
• Add legends to both scatter plots — clarifies orange = Type 0, green = Type 1.
• Move solution-end so the closing prose and the sim_random_select(...) sample run sit inside the dropdown solution (they were invisible until the reader opened it).

Out of scope

The remaining items from #419 are open-ended design suggestions (network diagrams in the preferences section, per-iteration happiness distribution plots, side-by-side figures, namedtuple refactor of location, refocusing the lecture narrative on local interactions). They aren't addressed here.

Closes #419.

🤖 Generated with Claude Code